An Extension of the Hardy-ramanujan Circle Method and Applications to Partitions without Sequences

نویسندگان

  • KATHRIN BRINGMANN
  • KARL MAHLBURG
چکیده

We develop a generalized version of the Hardy-Ramanujan “circle method” in order to derive asymptotic series expansions for the products of modular forms and mock theta functions. Classical asymptotic methods (including the circle method) do not work in this situation because such products are not modular, and in fact, the “error integrals” that occur in the transformations of the mock theta functions can (and often do) make a significant contribution to the asymptotic series. The resulting series include principal part integrals of Bessel functions, whereby the main asymptotic term can also be identified. To illustrate the application of our method, we calculate the asymptotic series expansion for the number of partitions without sequences. Andrews showed that the generating function for such partitions is the product of the third order mock theta function χ and a (modular) infinite product series. The resulting asymptotic expansion for this example is particularly interesting because the error integrals in the modular transformation of the mock theta function component appear in the exponential main term.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

AN EXTENSION OF THE HARDY-RAMANUJAN CIRCLE METHOD AND APPLICATIONS TO PARTITIONS WITHOUT SEQUENCES By KATHRIN BRINGMANN and KARL MAHLBURG

We develop a generalized version of the Hardy-Ramanujan “circle method” in order to derive asymptotic series expansions for the products of modular forms and mock theta functions. Classical asymptotic methods (including the circle method) do not work in this situation because such products are not modular, and in fact, the “error integrals” that occur in the transformations of the mock theta fu...

متن کامل

A Derivation of the Hardy-ramanujan Formula from an Arithmetic Formula

We re-prove the Hardy-Ramanujan asymptotic formula for the partition function without using the circle method. We derive our result from recent work of Bruinier and Ono on harmonic weak Maass forms.

متن کامل

Harish-Chandra Research Institute Introduction to the circle method of Hardy, Ramanujan and Littlewood

In these lectures we give an overview of the circle method introduced by Hardy and Ramanujan at the beginning of the twentieth century, and developed by Hardy, Littlewood and Vinogradov, among others. We also try to explain the main difficulties in proving Goldbach’s conjecture and we give a sketch of the proof of Vinogradov’s three-prime Theorem.

متن کامل

Towards an automation of the circle method

The derivation of the Hardy-Ramanujan-Rademacher formula for the number of partitions of n is reviewed. Next, the steps for finding analogous formulas for certain restricted classes of partitions or overpartitions is examined, bearing in mind how these calculations can be automated in a CAS. Finally, a number of new formulas of this type which were conjectured with the aid of Mathematica are pr...

متن کامل

An Asymptotic Formula for the Coefficients of J(z) Mathematics Subject Classification 2010: 11f30

Published 15 We obtain a new proof of an asymptotic formula for the coefficients of the j-invariant 16 of elliptic curves. Our proof does not use the circle method. We use Laplace's method 17 of steepest descent and the Hardy–Ramanujan asymptotic formula for the partition 18 function. (The latter asymptotic formula can be derived without the circle method.)

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010